Generalization of Heart-Oriented Rhotrix Multiplication and its Algorithm Implementation
نویسندگان
چکیده
ABSTRACT This paper introduces a novel generalized concept of higher order heart-oriented rhotrix multiplication expression. The multiplication method we adapted is intended to maintain the unique properties associated with the initial definition of rhotrix. The special multiplication process can be used to solve various problems involving n x n rhotrices multiplication. Most importantly a generalized expression for representing n-dimensional rhotrix in a computational environment is presented. Sequential computational algorithm for higher order rhotrices multiplication is designed to buttress the mathematical expression, axioms and logic presented in this paper.
منابع مشابه
Rhotrix Multiplication on Two-Dimensional Process Grid Topologies
This paper presents rhotrix multiplication and introduces its implementation on process grid topologies. Covered in this work, are reviews of generalization cases of n-dimensional rhotrix multiplication. A parallel program based on MPI master-worker paradigm is implemented. By means of analyzing the time complexity and memory requirement for the method, the authors provided insight into how to ...
متن کاملFast algorithms for anti-distance matrices as a generalization of Boolean matrices
We show that Boolean matrix multiplication, computed as a sum of products of column vectors with row vectors, is essentially the same as Warshall’s algorithm for computing the transitive closure matrix of a graph from its adjacency matrix. Warshall’s algorithm can be generalized to Floyd’s algorithm for computing the distance matrix of a graph with weighted edges. We will generalize Boolean mat...
متن کاملUnscented Auxiliary Particle Filter Implementation of the Cardinalized Probability Hypothesis Density Filters
The probability hypothesis density (PHD) filter suffers from lack of precise estimation of the expected number of targets. The Cardinalized PHD (CPHD) recursion, as a generalization of the PHD recursion, remedies this flaw and simultaneously propagates the intensity function and the posterior cardinality distribution. While there are a few new approaches to enhance the Sequential Monte Carlo (S...
متن کاملSTRONGLY DUO AND CO-MULTIPLICATION MODULES
Let R be a commutative ring. An R-module M is called co-multiplication provided that foreach submodule N of M there exists an ideal I of R such that N = (0 : I). In this paper weshow that co-multiplication modules are a generalization of strongly duo modules. Uniserialmodules of finite length and hence valuation Artinian rings are some distinguished classes ofco-multiplication rings. In additio...
متن کاملMandatory Assignment 1
The purpose of this document is to verify attendance of the author to the Scientific Computing course, at the Danish Technical University (DTU). A study of cache usage and its impact on computational performance of matrix multiplication is presented, where experiments are conducted on various combinations of algorithms for performing such multiplication, and datastructures for storing the matri...
متن کامل